Unfolding of Finite Concurrent Automata
نویسندگان
چکیده
منابع مشابه
Unfolding Synthesis of Asynchronous Automata
Zielonka’s theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a non-deterministic asynchronous automaton from a regular Mazurkiewicz trace language. Our approach is based on an unfolding procedur...
متن کاملParallel finite automata for modeling concurrent software systems
The class of parallel nite automata PFA is described that naturally expresses the interleaving parallelism inherent in Petri net notation without admitting the possibility of an in nite state space The equivalence of this class to deterministic nite automata DFA is demonstrated using an algorithm for generating an equivalent nondeterministic nite automaton NFA from a PFA A composition rule is g...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملConcurrent Automata
Partial order semantics of Petri nets have a long history. In this paper, we describe a formalism which combines partial order semantics with the usual notion of markings of a Petri net. We call this formalism concurrent automata. We present a generation algorithm for concurrent automata. We show that our algorithm is correct in the sense of semi language equivalence: The generated automaton re...
متن کاملConcurrent Timed Port Automata
We present a new and powerful class of automata which are explicitly concurrent and allow a very simple de nition of composition. The novelty of these automata is their time-synchronous message-asynchronous communication mechanism. Time synchrony is obtained by using a global clock. Message asynchrony is obtained by requiring the automata to react to every input. Explicit concurrency is obtaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.279.8